منابع مشابه
Reactive Links to Save Automata States
The goal of the reactive automata model is to reduce the space required for the implementation of automata. A reactive automaton has extra links whose role is to change the behaviour of the whole automaton. These links do not increase their expressiveness. Typical examples of regular expressions associated with deterministic automata of exponential size according to the length of the expression...
متن کاملMode-Automata: About Modes and States for Reactive Systems
In the eld of reactive system programming, dataaow synchronous languages like Lustre BCH + 85,CHPP87] or Signal GBBG85] ooer a syntax similar to block-diagrams, and can be eeciently compiled into C code, for instance. Designing a system that clearly exhibits several \independent" running modes is not diicult since the mode structure can be encoded explicitly with the available dataaow construct...
متن کاملDiscrete Simulation of Reactive Flow with Lattice Gas Automata
Normally, flow field is described with governing equations, such as the Navier-Stokes equations. However, for complex flow including multiphase and reactive flow such as combustion, this approach may not be suitable. As an alternative approach, Lattice Gas Automata (LGA) has been used to simulate fluid with mesoscopic particles by assuming that space and time are discrete, and the physical quan...
متن کاملSynthesizing Structured Reactive Programs via Deterministic Tree Automata
Existing approaches to the synthesis of reactive systems typically involve the construction of transition systems such as Mealy automata. However, in order to obtain a succinct representation of the desired system, structured programs can be a more suitable model. In 2011, Madhusudan proposed an algorithm to construct a structured reactive program for a given ω-regular specification without syn...
متن کاملCOREA: A Synchronous Calculus of Parallel Communicating Reactive Automata
Reactive systems often require temporal and logical safety , concurrency and determinism. Several asynchronous or strong synchronous answers have been proposed to this problem. However, \asyn-chronous" languages such as CSP or CCS generally force the user to choose between determinism and concurrency. On the other hand, strong synchronous implementations are mainly sequential. The aim of this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2011
ISSN: 0890-5401
DOI: 10.1016/j.ic.2011.01.002